Dynamic Models of Competition between Transportation Modes
نویسندگان
چکیده
منابع مشابه
Dynamic Models for Freight Transportation
Freight transportation is characterized by a variety of dynamic information processes: the demands of customers, the performance of people and equipment, and the performance of the network. In addition, large networks are characterized by how they organize decisions and information: who makes what decision with what information? This chapter approaches the development of models for freight tran...
متن کاملDynamic Integration of Heterogeneous Transportation Modes under Disruptive Events
An integrated urban transportation system usually consists of multiple transport modes that have complementary characteristics of capacities, speeds, and costs, facilitating smooth passenger transfers according to planned schedules. However, such an integration is not designed to operate under disruptive events, e.g., a signal failure at a subway station or a breakdown of a bus, which have ripp...
متن کاملEstimating Dynamic Models of Imperfect Competition∗
We describe a two-step algorithm for estimating dynamic games under the assumption that behavior is consistent with Markov perfect equilibrium. In the first step, the policy functions and the law of motion for the state variables are estimated. In the second step, the remaining structural parameters are estimated using the optimality conditions for equilibrium. The second step estimator is a si...
متن کاملInfrastructure pricing and competition between modes in urban transport
Privatization of transit and roads is gaining increasing interest. This paper develops a model in which infrastructure pricing and optimal capacity are analyzed under both public and private regimes. It compares optimal outputs (number of passengers) and capacities of public and private operators of rail transport. A crucial aspect of the paper is competition between modes: for instance, how ar...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Environment and Planning A: Economy and Space
سال: 1979
ISSN: 0308-518X,1472-3409
DOI: 10.1068/a110665